A Uniform Circuit Lower Bound for the Permanent Eric Allender and Vivek Gore
نویسنده
چکیده
We show that uniform families of ACC circuits of subexponential size cannot compute the permanent function. This also implies similar lower bounds for certain sets in PP. This is one of the very few examples of a lower bound in circuit complexity whose proof hinges on the uniformity condition; it is still unknown if there is any set in Ntime (2 O(1) ) that does not have nonuniform ACC circuits.
منابع مشابه
A Uniform Circuit Lower Bound for the Permanent
We show that uniform families of ACC circuits of subexponential size cannot compute the permanent function. This also implies similar lower bounds for certain sets in PP. This is one of the very few examples of a lower bound in circuit complexity where the uniformity condition is essential; it is still unknown if there is any set in Ntime (2 n O(1) ) that does not have nonuniform ACC circuits.
متن کاملLower Bounds for Uniform Constant Depth Circuits by Vivek Kashinath Gore
OF THE DISSERTATION Lower Bounds for Uniform Constant Depth Circuits by Vivek Kashinath Gore, Ph.D. Dissertation Director: Professor Eric Allender Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A big advantage of studying Boolean circuits is that they can be viewed as simple combinatorial objects and thus allow us to use many algebraic and com...
متن کاملRudimentary Reductions Revisited
We show that log-bounded rudimentary reductions (de ned and studied by Jones in 1975) characterize Dlogtime-uniform AC .
متن کاملThe Permanent Requires Large Uniform Threshold Circuits
We show that the permanent cannot be computed by uniform constantdepth threshold circuits of size T (n), for any function T such that for all k, T (n) = o(2). More generally, we show that any problem that is hard for the complexity class C=P requires circuits of this size (on the uniform constant-depth threshold circuit model). In particular, this lower bound applies to any problem that is hard...
متن کاملOn Circuit Complexity Classes and Iterated Matrix Multiplication
OF THE DISSERTATION On Circuit Complexity Classes and Iterated Matrix Multiplication by Fengming Wang Dissertation Director: Eric Allender In this thesis, we study small, yet important, circuit complexity classes within NC, such as ACC and TC. We also investigate the power of a closely related problem called Iterated Matrix Multiplication and its implications in low levels of algebraic complexi...
متن کامل